Mathematical Programs with Equilibrium Constraints : The existence of feasible points . December 22 , 2005
نویسنده
چکیده
The paper studies three classes of optimization problems with bilevel structure including mathematical programs with equilibrium constraints (MPEC) and semiinfinite problems (SIP). The main goal of the paper is to provide results which establish the existence of feasible points of the problems. These results are based on the so-called KKM Lemma. We are also interested in the convexity properties of these problems.
منابع مشابه
Regularization Method for Stochastic Mathematical Programs with Complementarity Constraints
In this paper, we consider a class of stochastic mathematical programs with equilibrium constraints (SMPECs) that has been discussed by Lin and Fukushima (2003). Based on a reformulation given therein, we propose a regularization method for solving the problems. We show that, under a weak condition, an accumulation point of the generated sequence is a feasible point of the original problem. We ...
متن کاملStability and Bifurcation of an SIS Epidemic Model with Saturated Incidence Rate and Treatment Function
In this paper an SIS epidemic model with saturated incidence rate and treatment func- tion is proposed and studied. The existence of all feasible equilibrium points is discussed. The local stability conditions of the disease free equilibrium point and endemic equilibrium point are established with the help of basic reproduction number.However the global stabili- ty conditions of these eq...
متن کاملOn the convergence of stationary sequences in topology optimization
We consider structural topology optimization problems including unilateral constraints arising from non-penetration conditions in contact mechanics. The resulting non-convex non-smooth problems are instances of mathematical programs with equilibrium constraints (MPEC), or bi-level programs. Applying nested (implicit programming) algorithms to this class of problems is problematic owing to the s...
متن کاملEquilibrium constrained optimization problems
We consider equilibrium constrained optimization problems, which have a general formulation that encompasses well-known models such as mathematical programs with equilibrium constraints, bilevel programs, and generalized semi-infinite programming problems. Based on the celebrated KKM lemma, we prove the existence of feasible points for the equilibrium constraints. Moreover, we analyze the topol...
متن کاملA two-sided relaxation scheme for Mathematical Programs with Equilibrium Constraints
We propose a relaxation scheme for mathematical programs with equilibrium constraints (MPECs). In contrast to previous approaches, our relaxation is two-sided: both the complementarity and the nonnegativity constraints are relaxed. The proposed relaxation update rule guarantees (under certain conditions) that the sequence of relaxed subproblems will maintain a strictly feasible interior—even in...
متن کامل